Degree-constrained 2-partitions of graphs
نویسندگان
چکیده
A (δ ≥ k1, δ ≥ k2)-partition of a graph G is a vertex-partition (V1, V2) of G satisfying that δ(G[Vi]) ≥ ki for i = 1, 2. We determine, for all positive integers k1, k2, the complexity of deciding whether a given graph has a (δ ≥ k1, δ ≥ k2)-partition. We also address the problem of finding a function g(k1, k2) such that the (δ ≥ k1, δ ≥ k2)-partition problem is NP-complete for the class of graphs of minimum degree less than g(k1, k2) and polynomial for all graphs with minimum degree at least g(k1, k2). We prove that g(1, k) = k for k ≥ 3, that g(2, 2) = 3 and that g(2, 3), if it exists, has value 4 or 5.
منابع مشابه
k-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملOn the Spanning Ratio of Constrained Yao-Graphs
We present upper bounds on the spanning ratio of constrained Yao-graphs with at least 7 cones. Given a set of points in the plane, a Yao-graph partitions the plane around each vertex into k disjoint cones, each having aperture θ = 2π/k, and adds an edge to the closest vertex in each cone. Constrained Yao-graphs have the additional property that no edge properly intersects any of the given line ...
متن کاملLow-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring
We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints. We use this in particular to find k-cuts of graphs of maximum degree ∆ that cut at least a k−1 k (1 + 1 2∆+k−1 ) fraction of the edges, improving previous bounds known. The partitions also apply to constraint networks, for which we gi...
متن کاملPartitioning into Two Graphs with Only Small Components
The paper presents several results on edge partitions and vertex partitions of graphs into graphs with bounded size components. We show that every graph of bounded tree-width and bounded maximum degree admits such partitions. We also show that an arbitrary graph of maximum degree three has a vertex partition into two graphs, each of which has components on at most two vertices, and an edge part...
متن کاملLow - degree Graph Partitioning via Local Searchwith Applications to Constraint Satisfaction
We present practical algorithms for constructing partitions of graphs into a xed number of vertex-disjoint subgraphs that satisfy particular degree constraints. We use this in particular to nd k-cuts of graphs of maximum degree that cut at least a k?1 k (1 + 1 22+k?1) fraction of the edges, improving previous bounds known. The partitions also apply to constraint networks, for which we give a ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.06216 شماره
صفحات -
تاریخ انتشار 2018